采用信息增益率的混合入侵检测模型设计

针对现有混合入侵检测模型仅定性选取特征而导致检测精度较低的问题，同时为了充分结合误用检测模型和异常检测模型的优势，提出一种采用信息增益率的混合入侵检测模型.首先，利用信息增益率定量地选择特征子集，最大程度地保留样本信息；其次，采用余弦时变粒子群算法确定支持向量机参数构建误用检测模型，使其更好地平衡粒子在全局和局部的搜索能力，然后，选取灰狼算法确定单类支持向量机参数构建异常检测模型，以此来提高对最优参数的搜索效率和精细程度，综合提高混合入侵检测模型对攻击的检测效果；最后，通过两种数据集进行仿真实验，验证了所提混合入侵检测模型具有较好的检测性能.     

Improving the multi-objective evolutionary optimization algorithm for hydropower reservoir operations in the California Oroville–Thermalito complex

This study demonstrates the application of an improved Evolutionary optimization Algorithm (EA), titled Multi-Objective Complex Evolution Global Optimization Method with Principal Component Analysis and Crowding Distance Operator (MOSPD), for the hydropower reservoir operation of the Oroville–Thermalito Complex (OTC) – a crucial head-water resource for the California State Water Project (SWP). In the OTC's water-hydropower joint management study, the nonlinearity of hydropower generation and the reservoir's water elevation–storage relationship are explicitly formulated by polynomial function in order to closely match realistic situations and reduce linearization approximation errors. Comparison among different curve-fitting methods is conducted to understand the impact of the simplification of reservoir topography. In the optimization algorithm development, techniques of crowding distance and principal component analysis are implemented to improve the diversity and convergence of the optimal solutions towards and along the Pareto optimal set in the objective space. A comparative evaluation among the new algorithm MOSPD, the original Multi-Objective Complex Evolution Global Optimization Method (MOCOM), the Multi-Objective Differential Evolution method (MODE), the Multi-Objective Genetic Algorithm (MOGA), the Multi-Objective Simulated Annealing approach (MOSA), and the Multi-Objective Particle Swarm Optimization scheme (MOPSO) is conducted using the benchmark functions. The results show that best the MOSPD algorithm demonstrated the best and most consistent performance when compared with other algorithms on the test problems. The newly developed algorithm (MOSPD) is further applied to the OTC reservoir releasing problem during the snow melting season in 1998 (wet year), 2000 (normal year) and 2001 (dry year), in which the more spreading and converged non-dominated solutions of MOSPD provide decision makers with better operational alternatives for effectively and efficiently managing the OTC reservoirs in response to the different climates, especially drought, which has become more and more severe and frequent in California.     

A web-based software tool for participatory optimization of conservation practices in watersheds

WRESTORE (Watershed Restoration Using Spatio-Temporal Optimization of Resources) is a web-based, participatory planning tool that can be used to engage with watershed stakeholder communities, and involve them in using science-based, human-guided, interactive simulation–optimization methods for designing potential conservation practices on their landscape. The underlying optimization algorithms, process simulation models, and interfaces allow users to not only spatially optimize the locations and types of new conservation practices based on quantifiable goals estimated by the dynamic simulation models, but also to include their personal subjective and/or unquantifiable criteria in the location and design of these practices. In this paper, we describe the software, interfaces, and architecture of WRESTORE, provide scenarios for implementing the WRESTORE tool in a watershed community's planning process, and discuss considerations for future developments.     

优化军工科研项目管理的具体策略

我国的军工科研所成立于上世纪，它以军工项目的科研、预研为主，为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长，军工科研院所也转变了原有的工业专属性质，走上了军民两用、寓军于民的道路，并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点，以项目管理的优化为具体策略进行军工科研开发工作。     

Electromagnetism-like algorithms for optimized tool path planning in 5-axis flank machining

Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality.     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

Ions motion algorithm for solving optimization problems

This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems.     

A novel approach to adaptive relational association rule mining

The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.     

Artificial bee colony based algorithm for maximum power point tracking (MPPT) for PV systems operating under partial shaded conditions

Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial conditions. In this paper, a novel artificial bee colony based maximum power point tracking algorithm (MPPT) is proposed. The developed algorithm, does not allow only overcoming the common drawback of the conventional MPPT methods, but it gives a simple and a robust MPPT scheme. A co-simulation methodology, combining Matlab/Simulink™ and Cadence/Pspice™, is used to verify the effectiveness of the proposed method and compare its performance, under dynamic weather conditions, with that of the Particle Swarm Optimization (PSO) based MPPT algorithm. Moreover, a laboratory setup has been realized and used to experimentally validate the proposed ABC-based MPPT algorithm. Simulation and experimental results have shown the satisfactory performance of the proposed approach.